Rsat 1.03: SAT Solver Description
نویسندگان
چکیده
Rsat is a DPLL–based solver that inherits many of the effective techniques introduced by MiniSat [3, 4] and Zchaff [6]. Rsat employs three improvements that have proven quite effective empirically. First, it employs techniques for reducing the time spent on Boolean constraint propagation. Next, it introduces a new technique that enables the solver to better focus on subproblems. Finally, Rsat employs an improved phase selection technique that has been designed to prevent the solver from repeating work it has already done upon backtracking.
منابع مشابه
SAT Solver Description: Rsat
Rsat is a DPLL–based solver that inherits many of the effective techniques introduced by MiniSat [3, 4] and Zchaff [6]. Rsat employs three improvements that have proven quite effective empirically. First, it employs techniques for reducing the time spent on Boolean constraint propagation. Next, it introduces a new technique that enables the solver to better focus on subproblems. Finally, Rsat e...
متن کاملLingeling, Plingeling and Treengeling Entering the SAT Competition 2013
This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences to the version of these solvers used in the SAT Challenge 2012. For further information we refer to the solver description [1] of the SAT Challenge 2012 or source code.
متن کاملYet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014
This paper serves as solver description for the SAT solvers Lingeling and its two parallel variants Treengeling and Plingeling, as well as for our new local search solver YalSAT entering the Competition 2014. For Lingeling and its variants we only list important differences to earlier version of these solvers as used in the SAT Competition 2013. For further information we refer to the solver de...
متن کاملPaMiraXT: Parallel SAT Solving with Threads and Message Passing
This article describes PaMiraXT, a powerful parallel SAT algorithm. PaMiraXT follows a master/client model based on message passing, making it suitable for any kind of workstation cluster. For the clients, MiraXT is used, which itself is thread-based parallel solver designed to take advantage of current and future shared memory multiprocessor systems. We highlight design and implementation deta...
متن کاملHaifaSat: a SAT solver based on an Abstraction/Refinement model
The popular abstraction/refinement model frequently used in verification, can also explain the success of a SAT decision heuristic like Berkmin. According to this model, conflict clauses are abstractions of the clauses from which they were derived. We suggest a clausebased decision heuristic called Clause-Move-To-Front (CMTF), which attempts to follow an abstraction/refinement strategy (based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007